By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

On the Position Value for Communication Situations

Peter Borm, Guillerom Owen, and Stif Tijs

pp. 305-320

BibTeX  Abstract Full Text:  PDF

Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems

Sunil Chopra

pp. 321-337

BibTeX  Abstract Full Text:  PDF

Almost Safe Gossiping in Bounded Degree Networks

Krzysztof Diks and Andrzej Pelc

pp. 338-344

BibTeX  Abstract Full Text:  PDF

Galois Groups and Factoring Polynomials over Finite Fields

Lajos Rónyai

pp. 345-365

BibTeX  Abstract Full Text:  PDF

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

JØrgen Bang-Jensen and Caresten Thomassen

pp. 366-376

BibTeX  Abstract Full Text:  PDF

Another Way of Counting $N^N $

Arthur T. Benjamin and Fritz Juhnke

pp. 377-379

BibTeX  Abstract Full Text:  PDF

IInfinite Graphs with Nonconstant Dirichlet Finite Harmonic Functions

Donald I. Cartwright and Wolfgang Woess

pp. 380-385

BibTeX  Abstract Full Text:  PDF

Mean Passage Times and Nearly Uncoupled Markov Chains

Refael Hassin and Moshe Haviv

pp. 386-397

BibTeX  Abstract Full Text:  PDF

Comparing Queues and Stacks As Machines for Laying Out Graphs

Lenwood S. Heath, Frank Thomson Leighton, and Arnold L. Rosenberg

pp. 398-412

BibTeX  Abstract Full Text:  PDF

A Combinatorial Approach to Biorthogonal Polynomials

Dongsu Kim

pp. 413-421

BibTeX  Abstract Full Text:  PDF

The Problem of Compatible Representatives

Donald E. Knuth and Arvind Raghunathan

pp. 422-427

BibTeX  Abstract Full Text:  PDF

Short Encodings of Evolving Structures

Daniel D. Sleator, Robert E. Trajan, and William P. Thurston

pp. 428-450

BibTeX  Abstract Full Text:  PDF